Beam-ACO for the travelling salesman problem with time windows
نویسندگان
چکیده
منابع مشابه
Beam-ACO for the travelling salesman problem with time windows
The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method combining ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and comput...
متن کاملThe travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization
In combinatorial optimization it is not rare to find problems whose mathematical structure is nearly the same, differing only in some aspect related to the motivating application. For example, many problems in machine scheduling and vehicle routing have equivalent formulations and only differ with respect to the optimization objective, or particular constraints. Moreover, while some problems re...
متن کاملApplications Of Ant Colony Optimization ACO ( Travelling Salesman Problem
-The ant colony optimization takes insipiration from the foraging behavior of some ant species.These ants deposits pheromone on the ground in order to make some suitable path that should be followed by other members of the colony.The goal of this paper is to introduce ant colony optimization and to survey its most notable applications.In this paper we focus on some research efforts directed at ...
متن کاملSolving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
Many optimization problems have several equivalent mathematical models. It is often not apparent which of these models is most suitable for practical computation, in particular, when a certain application with a specific range of instance sizes is in focus. Our paper addresses the Asymmetric Travelling Salesman Problem with time windows (ATSP-TW) from such a point of view. The real–world applic...
متن کاملA Polyhedral Study of the Asymmetric Travelling Salesman Problem with Time Windows
A polyhedral study of the asymmetric travelling salesman problem with time windows Abstract The asymmetric travelling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper we present a formulation of the problem involving only 0/1-variables associated with the arcs of the underlying digraph. This has the advantage of avoiding additi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2010
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.11.015